-
1 natural automaton
Большой англо-русский и русско-английский словарь > natural automaton
-
2 natural automaton
Математика: естественный автомат -
3 natural automaton
мат. -
4 automaton
-
5 естественный автомат
Большой англо-русский и русско-английский словарь > естественный автомат
-
6 decomposition
1) декомпозиция; разбиение; разложение2) распад; разложение3) расщепление4) геол. химическое выветривание•
См. также в других словарях:
Natural computing — For the scientific journal, see Natural Computing (journal). Natural computing, also called Natural computation, is a terminology introduced to encompass three classes of methods: 1) those that take inspiration from nature for the development of… … Wikipedia
automaton — automatous, adj. /aw tom euh ton , tn/, n., pl. automatons, automata / teuh/. 1. a mechanical figure or contrivance constructed to act as if by its own motive power; robot. 2. a person or animal that acts in a monotonous, routine manner, without… … Universalium
Cellular automaton — A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, theoretical biology and microstructure modeling. It consists of a regular grid of cells , each in one of a finite number of states … Wikipedia
ω-automaton — In automata theory, a branch of theoretical computer science, an ω automaton (or stream automaton) is a deterministic or nondeterministic automaton that runs on infinite, rather than finite, strings as input. Since ω automata do not stop, they… … Wikipedia
Complementation of Büchi automaton — In automata theory, complementation of a Büchi automaton is construction of another Büchi automaton that recognizes complement of the ω regular language recognized by the given Büchi automaton. Existence of algorithms for this construction proves … Wikipedia
Embedded pushdown automaton — An embedded pushdown automaton or EPDA is a computational model that parse languages in the tree adjoining grammar (TAG). It is similar to the context free grammar parsing pushdown automaton, except that instead of using a stack (data structure)… … Wikipedia
Parity automaton — A parity automaton is a variant of a finite state automaton that accepts infinite inputs. Unlike usual finite state automata, there is no set of final states; instead, each state is assigned a natural number. It accepts an infinite input sequence … Wikipedia
A New Kind of Science — Author(s) Stephen Wolfram Country … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Computability — You might be looking for Computable function, Computability theory, Computation, or Theory of computation. Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within… … Wikipedia
Switch-technology — is a technology for automata based programming support. It was proposed by Anatoly Shalyto in 1991. It involves software specification, design, implementation, debugging, documentation and maintenance. The term “automata based programming” is… … Wikipedia